Symmetric Groups on Sets of the Same Cardinality are Isomorphic

Theorem

Let G1=Sym(X1) and G2=Sym(X2) be symmetric groups on sets X1 and X2 such that |X1|=|X2|. Then G2G2.

Proof

Since |X1|=|X2|, we have a bijection ϕ:X1X2. As such, we define our isomorphism ψ:G1G2 by

ψ(f)=ϕfϕ1.

That is, we define a permutation of X2 by mapping into X1, permuting within X1, and then mapping back.

To show that this is a homomorphism, note that

ψ(fg)=ϕfgϕ1=ϕfidgϕ1=ϕfϕ1ϕgϕ1=ψ(f)ψ(g).

The fact that ψ is a bijection follows from the fact that it is a composition of three bijections.